Low-complexity comprehensive labeling and enhancement algorithm for compound documents

نویسنده

  • Onur G. Guleryuz
چکیده

We present a multiresolutional algorithm that segments a compound document and uses the results of the segmentation for document enhancement in copier applications. The document is initially segmented into halftone and non-halftone areas. Based on this segmentation the location of the edges due to text, graphics, and images (and not due to halftone dots) are detected on halftone as well as on non-halftone portions. We further detect constant-tone regions within non-halftone areas for subsequent bleed-through removal applications. Edge enhancement on detected edges and descreening on detected halftones are carried out. The algorithm can detect general halftones over regions of arbitrary sizes and shapes, and it can be straightforwardly adjusted for operation at various dpi resolutions. We obtain high detection probabilities on compound multilingual documents containing halftones and fine text. The proposed enhancement stage is tolerant of segmentation errors providing robust performance for the remaining problem cases. Our main contribution is the accomplishment of these tasks with a single pass algorithm that is computationally very simple and that requires less than 1% of full page memory, with active memory requirements less than .02% of full page memory. The operation of the algorithm can be imagined as a very thin line (of thickness the size of a “full-stop” in 11pt text) that rapidly scans an input page while simultaneously producing an output page.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs

An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Speech Enhancement by Modified Convex Combination of Fractional Adaptive Filtering

This paper presents new adaptive filtering techniques used in speech enhancement system. Adaptive filtering schemes are subjected to different trade-offs regarding their steady-state misadjustment, speed of convergence, and tracking performance. Fractional Least-Mean-Square (FLMS) is a new adaptive algorithm which has better performance than the conventional LMS algorithm. Normalization of LMS ...

متن کامل

Distributed and Cooperative Compressive Sensing Recovery Algorithm for Wireless Sensor Networks with Bi-directional Incremental Topology

Recently, the problem of compressive sensing (CS) has attracted lots of attention in the area of signal processing. So, much of the research in this field is being carried out in this issue. One of the applications where CS could be used is wireless sensor networks (WSNs). The structure of WSNs consists of many low power wireless sensors. This requires that any improved algorithm for this appli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Electronic Imaging

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2004